Tableau algorithms defined naturally for pictures
نویسنده
چکیده
The following text is an annotation to Marc A. A. van Leeuwen's paper " Tableau algorithms defined naturally for pictures " in its version of 25 November 2011. This annotation contains corrections of a few mistakes. Different comments are separated by horizontal lines, like this: Page 1, §1: Replace " as a tableaux " by " as tableaux ". Page 3, §2.2: Replace " The the non-empty " by " The non-empty ". Page 5, §2.4: Replace " identical entries allowed " by " identical entries are allowed ". Page 8: Replace " do far " by " so far ". Page 17, §5.1: Replace " inner cocorner of the shape " by " inner cocorner s of the shape ". Page 24, §5.4: Replace " approach the " by " approach to the " .
منابع مشابه
Tableau Systems for SHIO and SHIQ
Two prominent families of algorithms for the satisfiability test of DLs are automatabased algorithms (see e.g. [6]), which translate a concept C into an automaton AC accepting all (abstractions of) models for C, and tableau algorithms (TAs) [2], which incrementally create a tree-shaped (pre-) model for C using a set of completion rules. In short, the advantages of automata algorithms are on the...
متن کاملA Tableau Method for Verifying Dialogue Game Protocols for Agent Communication
In this paper, we propose a new tableau-based model checking technique for verifying dialogue game protocols for agent communication. These protocols are defined using our social commitment-based framework for agent communication called Commitment and Argument Network (CAN). We use a variant of CTL* (ACTL*) for specifying these protocols and the properties to be verified. This logic extends CTL...
متن کاملFrom Tableaux to Automata for Description Logics
This paper investigates the relationship between automataand tableau-based inference procedures for Description Logics. To be more precise, we develop an abstract notion of what a tableau-based algorithm is, and then show, on this abstract level, how tableau-based algorithms can be converted into automata-based algorithms. In particular, this allows us to characterize a large class of tableau-b...
متن کاملTableau Algorithms for Description Logics
Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system Kl-one. During the last decade, it has been shown that the important reasoning problems (like subsumption and satissability) in a great variety of description logics can be decided using tableau-like algorithms. This is not very surprising since description ...
متن کاملAn Overview of Tableau Algorithms for Description Logics
Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system KL-ONE. During the last decade, it has been shown that the important reasoning problems (like subsumption and satisfiability) in a great variety of description logics can be decided using tableau-like algorithms. This is not very surprising since description...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 157 شماره
صفحات -
تاریخ انتشار 1996